package day_2022_7_to_8.day48;

/**
 * @author haomin
 * @date 2022/08/18 10:14
 **/
public class Day33_2_Num64_MinPathSum {
    class Solution {
        public int minPathSum(int[][] grid) {
            for(int i = 0;i < grid.length;i++){
                for(int j = 0;j < grid[0].length;j++){
                    if(i == 0 && j == 0) continue;
                    else if(i == 0) grid[i][j] = grid[i][j] + grid[i][j-1];
                    else if(j == 0) grid[i][j] = grid[i][j] + grid[i-1][j];
                    else grid[i][j] = grid[i][j] + Math.min(grid[i-1][j],grid[i][j-1]);
                }
            }
            return grid[grid.length-1][grid[0].length-1];
        }
    }
}